Distributed Solver for Discrete-Time Lyapunov Equations Over Dynamic Networks With Linear Convergence Rate
نویسندگان
چکیده
منابع مشابه
A Randomized Asynchronous Linear Solver with Provable Convergence Rate
Asynchronous methods for solving systems of linear equations have been researched since Chazan and Miranker published their pioneering paper on chaotic relaxation in 1969. The underlying idea of asynchronous methods is to avoid processor idle time by allowing the processors to continue to work and make progress even if not all progress made by other processors has been communicated to them. His...
متن کاملPositive 2D Discrete-Time Linear Lyapunov Systems
Two models of positive 2D discrete-time linear Lyapunov systems are introduced. For both the models necessary and sufficient conditions for positivity, asymptotic stability, reachability and observability are established. The discussion is illustrated with numerical examples.
متن کاملDistributed Asynchronous Algorithms for Solving Positive Definite Linear Equations over Dynamic Networks
This paper develops Subset Equalizing (SE), a distributed algorithm for solving a symmetric positive definite system of linear equations over a network of agents with arbitrary asynchronous interactions and membership dynamics, where each agent may join and leave the network at any time, for infinitely many times, and may lose all its memory upon leaving. To design and analyze SE, we introduce ...
متن کاملFirst order linear fuzzy dynamic equations on time scales
In this paper, we study the concept of generalized differentiability for fuzzy-valued functions on time scales. Usingthe derivative of the product of two functions, we provide solutions to first order linear fuzzy dynamic equations. Wepresent some examples to illustrate our results.
متن کاملA Fast Distributed Solver for Symmetric Diagonally Dominant Linear Equations
In this paper, we propose a fast distributed solver for linear equations given by symmetric diagonally dominant M-Matrices. Our approach is based on a distributed implementation of the parallel solver of Spielman and Peng by considering a specific approximated inverse chain which can be computed efficiently in a distributed fashion. Representing the system of equations by a graph G, the propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2020
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2020.2989835